Analytical Approach to the Protein Design Problem
نویسندگان
چکیده
منابع مشابه
An Analytical Approach to the Protein Designability Problem
We present an analytical method for determining the designability of protein structures. We apply our method to the case of two-dimensional lattice structures, and give a systematic solution for the spectrum of any structure. Using this spectrum, the designability of a structure can be estimated. We outline a heirarchy of structures, from most to least designable, and show that this heirarchy d...
متن کاملA Deterministic Approach to the Protein Design Problem
We have considered the problem of protein design based on a model where the contact energy between amino acid residues is fitted phenomenologically using the Miyazawa–Jernigan matrix. Due to the simple form of the contact energy function, an analytical prescription is found which allows us to design energetically stable sequences for fixed amino acid residues compositions and target structures....
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولAn analytical approach to the partial scan problem
The scan design is the most widely used technique used to ensure the testability of sequential circuits. In this article it is shown that testability is still guaranteed, even if only a small part of the flipflops is integrated into a scan path. An algorithm is presented for selecting a minimal number of flipflops, which must be directly accessible. The direct accessibility ensures that, for ea...
متن کاملAn analytical approach to the dynamic topology problem
Currently, it is possible to modify (say, hourly) the topology of a data communications network by adding or deleting network links and/or by increasing or decreasing bandwidth on existing links in response to changing traffic loads and/or projected network conditions. The intent of this paper is to study a Markov decision process (MDP) model of the dynamic topology problem (DTP), the problem o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 1999
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.83.4437